optsat: A Tool for Solving SAT Related Optimization Problems
نویسندگان
چکیده
STAR-Lab, DIST, University of Genova viale Francesco Causa, 13 — 16145 Genova (Italy) {enrico,marco}@dist.unige.it
منابع مشابه
Structure-Based Satisfiability Checking
Constraint satisfaction deals with developing automated techniques for solving computationally hard problems in a declarative fashion. This note summarizes a dissertation that focuses on search-based methods for the propositional satisfiability problem (SAT). As methods for propositional satisfiability checking have rapidly progressed during the last 15 years, implementations of decision proced...
متن کاملOptimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver to solve the underlying analysis or reasoning problem. The solving time for SAT solvers can vary substantially for semantically identical SAT problems depending on how the problem is expressed. This property motivates ...
متن کاملA System for Solving Constraint Satisfaction Problems with SMT
SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vectors, etc, in first-order logic with equality. SMT has its roots in the field of verification. It is known that the SAT technology offers an interesting, efficient and scalable method for constraint solving, as many experimentati...
متن کاملThesis for the Degree of Doctor of Philosophy Effective SAT Solving
A growing number of problem domains are successfully being tackled by SAT solvers. This thesis contributes to that trend by pushing the state-of-the-art of core SAT algorithms and their implementation, but also in several important application areas. It consists of five papers: the first details the implementation of the SAT solver MINISAT and the other four papers discuss specific issues relat...
متن کاملStructure-based satisfiability checking : analyzing and harnessing the potential
Constraint satisfaction deals with developing automated techniques for solving computationally hard problems in a declarative fashion. The main emphasis of this thesis is on constraint satisfaction techniques for the propositional satisfiability problem (SAT). As solving techniques for propositional satisfiability have rapidly progressed during the last 15 years, implementations of decision pro...
متن کامل